Stable Locating-Dominating Sets in the Edge Corona and Lexicographic Product of Graphs
نویسندگان
چکیده
A set S ⊆ V (G) of an undirected graph G is a locating-dominating if for each v ∈ \ S, there exists w such tha vw E(G) and NG(x) ∩ ̸= NG(y) any two distinct vertices x y in S. stable it {v} The minimum cardinality G, denoted by γSLD(G), called the locating-domination number G. In this paper, we investigate concept corresponding parameter edge corona lexicographic product graphs.
منابع مشابه
Locating-dominating sets in twin-free graphs
A locating-dominating set a of graph G is a dominating set D of G with the additional property that every two distinct vertices outside D have distinct neighbors in D; that is, for distinct vertices u and v outside D, N(u) ∩D 6= N(v) ∩D where N(u) denotes the open neighborhood of u. A graph is twin-free if every two distinct vertices have distinct open and closed neighborhoods. The location-dom...
متن کاملthe hyper edge-wiener index of corona product of graphs
let $g$ be a simple connected graph. the edge-wiener index $w_e(g)$ is the sum of all distances between edges in $g$, whereas the hyper edge-wiener index $ww_e(g)$ is defined as {footnotesize $w{w_e}(g) = {frac{1}{2}}{w_e}(g) + {frac{1}{2}} {w_e^{2}}(g)$}, where {footnotesize $ {w_e^{2}}(g)=sumlimits_{left{ {f,g} right}subseteq e(g)} {d_e^2(f,g)}$}. in this paper, we present explicit formula fo...
متن کاملMetric-Locating-Dominating Sets in Graphs
If u and v are vertices of a graph, then d(u, v) denotes the distance from u to v. Let S = {v1, v2, . . . , vk} be a set of vertices in a connected graph G. For each v ∈ V (G), the k-vector cS(v) is defined by cS(v) = (d(v, v1), d(v, v2), · · · , d(v, vk)). A dominating set S = {v1, v2, . . . , vk} in a connected graph G is a metric-locatingdominating set, or an MLD-set, if the k-vectors cS(v) ...
متن کاملSome Dominating Sets of Lexicographic Product Graphs of Euler Totient Cayley Graphs with Arithmetic Graphs
The theory of domination in graphs is an emerging area of research in graph theory today. It has been studied extensively and finds applications to various branches of Science & Technology.Products are often viewed as a convenient language with which one can describe structures, but they are increasingly being applied in more substantial ways. In this paper, we consider lexicographic product gr...
متن کاملCharacterizations of minimal dominating sets and the well-dominated property in lexicographic product graphs
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. In this work, we introduce the notion of an irreducible dominating set, a variant of dominating set generalizing both minimal dominating sets and minimal total dominating sets. Based on this notion, we characterize the family of minimal dominating sets in a lexicographic product of two graphs and deriv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Pure and Applied Mathematics
سال: 2023
ISSN: ['1307-5543']
DOI: https://doi.org/10.29020/nybg.ejpam.v16i1.4645